<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/basic_graph/graph_dfs/dfs_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('dfs__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">dfs_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="dfs__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef DFS_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define DFS_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="dfs_8h.html">dfs.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="header_8h.html">src/header.h</a>&quot;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include&quot;../graph_representation/graph/graph.h&quot;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#include&quot;../graph_representation/graph_vertex/dfs_vertex.h&quot;</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02dfs__test_8h_03.html">   26</a></span>&#160;<span class="keyword">namespace  </span>{</div>
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">   27</a></span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>= 10;  </div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;}</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">IntroductionToAlgorithm::GraphAlgorithm::Graph</a>;</div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">IntroductionToAlgorithm::GraphAlgorithm::DFS_Vertex</a>;</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">IntroductionToAlgorithm::GraphAlgorithm::depth_first_search</a>;</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html">   42</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_d_f_s_test.html">DFSTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;{</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#a32b63a9c79f6f7e7021daacf076a1512">   45</a></span>&#160;<span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">Graph&lt;DFS_N,DFS_Vertex&lt;double&gt;</a>&gt; <a class="code" href="class_d_f_s_test.html#a32b63a9c79f6f7e7021daacf076a1512">GType</a>; </div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#ac4c131b9b4f9de55192b1c634dc1c37f">   46</a></span>&#160;<span class="keyword">typedef</span> std::function&lt;void(DFS_Vertex&lt;double&gt;::VIDType v_id,<span class="keywordtype">int</span> time)&gt; <a class="code" href="class_d_f_s_test.html#ac4c131b9b4f9de55192b1c634dc1c37f">ActionType</a>;</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#aa8af56e0d079eb7c2b0ba7b6535d7d61">   48</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_d_f_s_test.html#aa8af56e0d079eb7c2b0ba7b6535d7d61">SetUp</a>()</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    {</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <a class="code" href="class_d_f_s_test.html#a4dbae7784992bee522457b53da2141c2">_1v_graph</a>=std::make_shared&lt;GType&gt;(-1);<span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <a class="code" href="class_d_f_s_test.html#a4dbae7784992bee522457b53da2141c2">_1v_graph</a>-&gt;add_vertex(1.0);  <span class="comment">//该图只有一个顶点</span></div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <a class="code" href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">_1e_graph</a>=std::make_shared&lt;GType&gt;(-1);<span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <a class="code" href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">_1e_graph</a>-&gt;add_vertex(2.0);</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <a class="code" href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">_1e_graph</a>-&gt;add_vertex(2.1);</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <a class="code" href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">_1e_graph</a>-&gt;add_edge(std::make_tuple(0,1,1));  <span class="comment">//该图只有一条边</span></div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="comment">//****  含顶点图和边图：10个顶点，9条边   ****</span></div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <a class="code" href="class_d_f_s_test.html#a9607eac5350c4cdd449c353fed482efc">_list_graph</a>=std::make_shared&lt;GType&gt;(-1); <span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>;i++)</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            <a class="code" href="class_d_f_s_test.html#a9607eac5350c4cdd449c353fed482efc">_list_graph</a>-&gt;add_vertex(1+i/DFS_N);</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;DFS_N-1;i++)</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <a class="code" href="class_d_f_s_test.html#a9607eac5350c4cdd449c353fed482efc">_list_graph</a>-&gt;add_edge(std::make_tuple(i,i+1,10+i)); <span class="comment">//该图的边是从左到右组成一个链条</span></div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        <span class="comment">//****  含顶点图和边图：10个顶点，9条边   ****</span></div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <a class="code" href="class_d_f_s_test.html#a93a79d0654eb82517990c8f5419148a8">_rlist_graph</a>=std::make_shared&lt;GType&gt;(-1); <span class="comment">//边的无效权重为-1</span></div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>;i++)</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <a class="code" href="class_d_f_s_test.html#a93a79d0654eb82517990c8f5419148a8">_rlist_graph</a>-&gt;add_vertex(1+i/DFS_N);</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;DFS_N-1;i++)</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <a class="code" href="class_d_f_s_test.html#a93a79d0654eb82517990c8f5419148a8">_rlist_graph</a>-&gt;add_edge(std::make_tuple(i,i+1,10+i)); <span class="comment">//该图的边是从左到右组成一个链条</span></div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    }</div>
<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#afbe32ab6557cbca62368b480e1df593a">   73</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_d_f_s_test.html#afbe32ab6557cbca62368b480e1df593a">TearDown</a>(){}</div>
<div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#a4dbae7784992bee522457b53da2141c2">   74</a></span>&#160;    std::shared_ptr&lt;GType&gt; <a class="code" href="class_d_f_s_test.html#a4dbae7784992bee522457b53da2141c2">_1v_graph</a>;    </div>
<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">   75</a></span>&#160;    std::shared_ptr&lt;GType&gt; <a class="code" href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">_1e_graph</a>;    </div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#a9607eac5350c4cdd449c353fed482efc">   76</a></span>&#160;    std::shared_ptr&lt;GType&gt; <a class="code" href="class_d_f_s_test.html#a9607eac5350c4cdd449c353fed482efc">_list_graph</a>;    </div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="class_d_f_s_test.html#a93a79d0654eb82517990c8f5419148a8">   77</a></span>&#160;    std::shared_ptr&lt;GType&gt; <a class="code" href="class_d_f_s_test.html#a93a79d0654eb82517990c8f5419148a8">_rlist_graph</a>;    </div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;};</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;</div>
<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="dfs__test_8h.html#a96ff24953353177d4929ba0e3cea3450">   84</a></span>&#160;<a class="code" href="dfs__test_8h.html#a96ff24953353177d4929ba0e3cea3450">TEST_F</a>(<a class="code" href="class_d_f_s_test.html">DFSTest</a>,test_dfs)</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;{</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    {</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        std::ostringstream discover_os;</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        std::ostringstream finished_os;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        ActionType print_discover=[&amp;discover_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){discover_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        ActionType print_finished=[&amp;finished_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){finished_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="comment">//****** 测试只有一个顶点的图**********</span></div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">depth_first_search</a>(_1v_graph,print_discover,print_finished);</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        EXPECT_EQ(discover_os.str(),<span class="stringliteral">&quot;0,&quot;</span>);</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        EXPECT_EQ(finished_os.str(),<span class="stringliteral">&quot;0,&quot;</span>);</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    }</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    {</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        std::ostringstream discover_os;</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        std::ostringstream finished_os;</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        ActionType print_discover=[&amp;discover_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){discover_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        ActionType print_finished=[&amp;finished_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){finished_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="comment">//****** 测试只有一条边的图**********</span></div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">depth_first_search</a>(_1e_graph,print_discover,print_finished);</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        EXPECT_EQ(discover_os.str(),<span class="stringliteral">&quot;0,1,&quot;</span>);</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        EXPECT_EQ(finished_os.str(),<span class="stringliteral">&quot;1,0,&quot;</span>);</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    }</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    {</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        std::ostringstream discover_os;</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        std::ostringstream finished_os;</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        ActionType print_discover=[&amp;discover_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){discover_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        ActionType print_finished=[&amp;finished_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){finished_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="comment">//****** 测试测试链边的图**********</span></div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        std::string real_discover_str,real_finish_str;</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <span class="keywordtype">char</span> char_from_int[2];</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>;i++)</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        {</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;            itoa(i,char_from_int,10);</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            real_discover_str+=std::string(char_from_int)+<span class="stringliteral">&quot;,&quot;</span>;</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            itoa(DFS_N-i-1,char_from_int,10);</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            real_finish_str+=std::string(char_from_int)+<span class="stringliteral">&quot;,&quot;</span>;</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        }</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">depth_first_search</a>(_list_graph,print_discover,print_finished);</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        EXPECT_EQ(discover_os.str(),real_discover_str);</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        EXPECT_EQ(finished_os.str(),real_finish_str);</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    }</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    {</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        ActionType empty_action=[](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){};</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        std::ostringstream discover_os;</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        std::ostringstream finished_os;</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        ActionType print_discover=[&amp;discover_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){discover_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        ActionType print_finished=[&amp;finished_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){finished_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        <span class="comment">//****** 测试测试链边的图，逆序**********</span></div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        std::string real_discover_str,real_finish_str;</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        std::vector&lt;DFS_Vertex&lt;double&gt;::VIDType&gt; search_order;</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        <span class="keywordtype">char</span> char_from_int[2];</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=<a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>-1;i&gt;=0;i--)</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;        {</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;            search_order.push_back(i);</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;            itoa(i,char_from_int,10);</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;            real_discover_str+=std::string(char_from_int)+<span class="stringliteral">&quot;,&quot;</span>;</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;            real_finish_str+=std::string(char_from_int)+<span class="stringliteral">&quot;,&quot;</span>;</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        }</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">depth_first_search</a>(_rlist_graph,print_discover,print_finished,empty_action,empty_action,search_order);</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;        EXPECT_EQ(discover_os.str(),real_discover_str);</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        EXPECT_EQ(finished_os.str(),real_finish_str);</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;    }</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;}</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;</div>
<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="dfs__test_8h.html#a6b86467f9b279500cd432392849a36e6">  155</a></span>&#160;<a class="code" href="dfs__test_8h.html#a96ff24953353177d4929ba0e3cea3450">TEST_F</a>(<a class="code" href="class_d_f_s_test.html">DFSTest</a>,test_get_path)</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;{</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;    std::ostringstream discover_os;</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;    std::ostringstream finished_os;</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;    ActionType print_discover=[&amp;discover_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){discover_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;    ActionType print_finished=[&amp;finished_os](<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">DFS_Vertex&lt;double&gt;::VIDType</a> v_id,<span class="keywordtype">int</span> time){finished_os&lt;&lt;v_id&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;};</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;   <span class="comment">//**** 测试链边的图**********</span></div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;   <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">depth_first_search</a>(_list_graph,print_discover,print_finished);</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;   <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>;i++)</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;   {</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;       std::vector&lt;int&gt; real;</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;       <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=i;j&lt;<a class="code" href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">DFS_N</a>;j++)</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;           real.push_back(j);</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;       EXPECT_EQ(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a1581960f77507024b39572aeb6d1fbd6">get_path</a>(_list_graph-&gt;vertexes.at(i),_list_graph-&gt;vertexes.at(DFS_N-1)),real)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;   }</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;}</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="preprocessor">#endif //DFS_TEST</span></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_a9f44099f26242f50087b3cc16dff965f"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a9f44099f26242f50087b3cc16dff965f">IntroductionToAlgorithm::GraphAlgorithm::depth_first_search</a></div><div class="ttdeci">void depth_first_search(std::shared_ptr&lt; GraphType &gt; graph, std::function&lt; void(typename GraphType::VIDType, int)&gt; pre_action=[](typename GraphType::VIDType, int){}, std::function&lt; void(typename GraphType::VIDType, int)&gt; post_action=[](typename GraphType::VIDType, int){}, std::function&lt; void(typename GraphType::VIDType, int)&gt; pre_root_action=[](typename GraphType::VIDType, int){}, std::function&lt; void(typename GraphType::VIDType, int)&gt; post_root_action=[](typename GraphType::VIDType, int){}, const std::vector&lt; typename GraphType::VIDType &gt; &amp;search_order=std::vector&lt; typename GraphType::VIDType &gt;())</div><div class="ttdoc">depth_first_search：深度优先搜索，算法导论22章22.3节 </div><div class="ttdef"><b>Definition:</b> <a href="dfs_8h_source.html#l00138">dfs.h:138</a></div></div>
<div class="ttc" id="header_8h_html"><div class="ttname"><a href="header_8h.html">header.h</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_a1581960f77507024b39572aeb6d1fbd6"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a1581960f77507024b39572aeb6d1fbd6">IntroductionToAlgorithm::GraphAlgorithm::get_path</a></div><div class="ttdeci">std::vector&lt; typename VertexType::VIDType &gt; get_path(const std::shared_ptr&lt; VertexType &gt; v_from, const std::shared_ptr&lt; VertexType &gt; v_to)</div><div class="ttdoc">get_path：获取两个顶点之间的路径 </div><div class="ttdef"><b>Definition:</b> <a href="header_8h_source.html#l00141">header.h:141</a></div></div>
<div class="ttc" id="dfs_8h_html"><div class="ttname"><a href="dfs_8h.html">dfs.h</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_a4dbae7784992bee522457b53da2141c2"><div class="ttname"><a href="class_d_f_s_test.html#a4dbae7784992bee522457b53da2141c2">DFSTest::_1v_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GType &gt; _1v_graph</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00074">dfs_test.h:74</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_d_f_s___vertex.html">IntroductionToAlgorithm::GraphAlgorithm::DFS_Vertex</a></div><div class="ttdoc">DFS_Vertex：用于深度优先搜索的顶点类型，算法导论22章22.3节 </div><div class="ttdef"><b>Definition:</b> <a href="dfs__vertex_8h_source.html#l00042">dfs_vertex.h:42</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_a93a79d0654eb82517990c8f5419148a8"><div class="ttname"><a href="class_d_f_s_test.html#a93a79d0654eb82517990c8f5419148a8">DFSTest::_rlist_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GType &gt; _rlist_graph</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00077">dfs_test.h:77</a></div></div>
<div class="ttc" id="class_d_f_s_test_html"><div class="ttname"><a href="class_d_f_s_test.html">DFSTest</a></div><div class="ttdoc">DFSTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00042">dfs_test.h:42</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_aa8af56e0d079eb7c2b0ba7b6535d7d61"><div class="ttname"><a href="class_d_f_s_test.html#aa8af56e0d079eb7c2b0ba7b6535d7d61">DFSTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00048">dfs_test.h:48</a></div></div>
<div class="ttc" id="dfs__test_8h_html_a96ff24953353177d4929ba0e3cea3450"><div class="ttname"><a href="dfs__test_8h.html#a96ff24953353177d4929ba0e3cea3450">TEST_F</a></div><div class="ttdeci">TEST_F(DFSTest, test_dfs)</div><div class="ttdoc">test_dfs:测试depth_first_search方法 </div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00084">dfs_test.h:84</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">IntroductionToAlgorithm::GraphAlgorithm::Graph</a></div><div class="ttdoc">Graph：图，算法导论22章22.1节 </div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00042">graph.h:42</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_a9607eac5350c4cdd449c353fed482efc"><div class="ttname"><a href="class_d_f_s_test.html#a9607eac5350c4cdd449c353fed482efc">DFSTest::_list_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GType &gt; _list_graph</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00076">dfs_test.h:76</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_ac4c131b9b4f9de55192b1c634dc1c37f"><div class="ttname"><a href="class_d_f_s_test.html#ac4c131b9b4f9de55192b1c634dc1c37f">DFSTest::ActionType</a></div><div class="ttdeci">std::function&lt; void(DFS_Vertex&lt; double &gt;::VIDType v_id, int time)&gt; ActionType</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00046">dfs_test.h:46</a></div></div>
<div class="ttc" id="namespaceanonymous__namespace_02dfs__test_8h_03_html_a37ec41bc82ae94b1f3736e26c9754ffb"><div class="ttname"><a href="namespaceanonymous__namespace_02dfs__test_8h_03.html#a37ec41bc82ae94b1f3736e26c9754ffb">anonymous_namespace{dfs_test.h}::DFS_N</a></div><div class="ttdeci">const int DFS_N</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00027">dfs_test.h:27</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_a32b63a9c79f6f7e7021daacf076a1512"><div class="ttname"><a href="class_d_f_s_test.html#a32b63a9c79f6f7e7021daacf076a1512">DFSTest::GType</a></div><div class="ttdeci">Graph&lt; DFS_N, DFS_Vertex&lt; double &gt; &gt; GType</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00045">dfs_test.h:45</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_afbe32ab6557cbca62368b480e1df593a"><div class="ttname"><a href="class_d_f_s_test.html#afbe32ab6557cbca62368b480e1df593a">DFSTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00073">dfs_test.h:73</a></div></div>
<div class="ttc" id="class_d_f_s_test_html_ae5351e523345888ffc64aa892d93d3c2"><div class="ttname"><a href="class_d_f_s_test.html#ae5351e523345888ffc64aa892d93d3c2">DFSTest::_1e_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GType &gt; _1e_graph</div><div class="ttdef"><b>Definition:</b> <a href="dfs__test_8h_source.html#l00075">dfs_test.h:75</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_7ed7dee3af3b488a5e053ec9bcb71f0e.html">basic_graph</a></li><li class="navelem"><a class="el" href="dir_0378c045220c77c61c3962fa329eda72.html">graph_dfs</a></li><li class="navelem"><a class="el" href="dfs__test_8h.html">dfs_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
